PRISM

Benchmark
Model:egl v.1 (DTMC)
Parameter(s)N = 10, L = 8
Property:messagesB (exp-reward)
Invocation (default)
./fix-syntax ./prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 egl.prism egl.props --property messagesB -const N=10,L=8
Execution
Walltime:64.76841044425964s
Return code:0
Relative Error:1.0751316283480098e-16
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Mar 14 12:06:40 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 egl.prism egl.props --property messagesB -const 'N=10,L=8'

Parsing model file "egl.prism"...

Type:        DTMC
Modules:     counter partyA partyB 
Variables:   b n phase party b0 b20 b1 b21 b2 b22 b3 b23 b4 b24 b5 b25 b6 b26 b7 b27 b8 b28 b9 b29 b10 b30 b11 b31 b12 b32 b13 b33 b14 b34 b15 b35 b16 b36 b17 b37 b18 b38 b19 b39 a0 a20 a1 a21 a2 a22 a3 a23 a4 a24 a5 a25 a6 a26 a7 a27 a8 a28 a9 a29 a10 a30 a11 a31 a12 a32 a13 a33 a14 a34 a15 a35 a16 a36 a17 a37 a18 a38 a19 a39 

Parsing properties file "egl.props"...

4 properties:
(1) "messagesA": R{"messages_A_needs"}=? [ F phase=4 ]
(2) "messagesB": R{"messages_B_needs"}=? [ F phase=4 ]
(3) "unfairA": P=? [ F !"knowA"&"knowB" ]
(4) "unfairB": P=? [ F !"knowB"&"knowA" ]

---------------------------------------------------------------------

Model checking: "messagesB": R{"messages_B_needs"}=? [ F phase=4 ]
Model constants: N=10,L=8

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...
Model constants: N=10,L=8

Warning: Guard for command 11 of module "partyA" is never satisfied.

Warning: Guard for command 12 of module "partyA" is never satisfied.

Warning: Guard for command 13 of module "partyA" is never satisfied.

Warning: Guard for command 14 of module "partyA" is never satisfied.

Warning: Guard for command 15 of module "partyA" is never satisfied.

Warning: Guard for command 16 of module "partyA" is never satisfied.

Warning: Guard for command 17 of module "partyA" is never satisfied.

Warning: Guard for command 18 of module "partyA" is never satisfied.

Warning: Guard for command 19 of module "partyA" is never satisfied.

Warning: Guard for command 20 of module "partyA" is never satisfied.

Warning: Guard for command 31 of module "partyA" is never satisfied.

Warning: Guard for command 32 of module "partyA" is never satisfied.

Warning: Guard for command 33 of module "partyA" is never satisfied.

Warning: Guard for command 34 of module "partyA" is never satisfied.

Warning: Guard for command 35 of module "partyA" is never satisfied.

Warning: Guard for command 36 of module "partyA" is never satisfied.

Warning: Guard for command 37 of module "partyA" is never satisfied.

Warning: Guard for command 38 of module "partyA" is never satisfied.

Warning: Guard for command 39 of module "partyA" is never satisfied.

Warning: Guard for command 40 of module "partyA" is never satisfied.

Warning: Guard for command 51 of module "partyA" is never satisfied.

Warning: Guard for command 52 of module "partyA" is never satisfied.

Warning: Guard for command 53 of module "partyA" is never satisfied.

Warning: Guard for command 54 of module "partyA" is never satisfied.

Warning: Guard for command 55 of module "partyA" is never satisfied.

Warning: Guard for command 56 of module "partyA" is never satisfied.

Warning: Guard for command 57 of module "partyA" is never satisfied.

Warning: Guard for command 58 of module "partyA" is never satisfied.

Warning: Guard for command 59 of module "partyA" is never satisfied.

Warning: Guard for command 60 of module "partyA" is never satisfied.

Warning: Guard for command 11 of module "partyB" is never satisfied.

Warning: Guard for command 12 of module "partyB" is never satisfied.

Warning: Guard for command 13 of module "partyB" is never satisfied.

Warning: Guard for command 14 of module "partyB" is never satisfied.

Warning: Guard for command 15 of module "partyB" is never satisfied.

Warning: Guard for command 16 of module "partyB" is never satisfied.

Warning: Guard for command 17 of module "partyB" is never satisfied.

Warning: Guard for command 18 of module "partyB" is never satisfied.

Warning: Guard for command 19 of module "partyB" is never satisfied.

Warning: Guard for command 20 of module "partyB" is never satisfied.

Warning: Guard for command 31 of module "partyB" is never satisfied.

Warning: Guard for command 32 of module "partyB" is never satisfied.

Warning: Guard for command 33 of module "partyB" is never satisfied.

Warning: Guard for command 34 of module "partyB" is never satisfied.

Warning: Guard for command 35 of module "partyB" is never satisfied.

Warning: Guard for command 36 of module "partyB" is never satisfied.

Warning: Guard for command 37 of module "partyB" is never satisfied.

Warning: Guard for command 38 of module "partyB" is never satisfied.

Warning: Guard for command 39 of module "partyB" is never satisfied.

Warning: Guard for command 40 of module "partyB" is never satisfied.

Warning: Guard for command 51 of module "partyB" is never satisfied.

Warning: Guard for command 52 of module "partyB" is never satisfied.

Warning: Guard for command 53 of module "partyB" is never satisfied.

Warning: Guard for command 54 of module "partyB" is never satisfied.

Warning: Guard for command 55 of module "partyB" is never satisfied.

Warning: Guard for command 56 of module "partyB" is never satisfied.

Warning: Guard for command 57 of module "partyB" is never satisfied.

Warning: Guard for command 58 of module "partyB" is never satisfied.

Warning: Guard for command 59 of module "partyB" is never satisfied.

Warning: Guard for command 60 of module "partyB" is never satisfied.

Computing reachable states...

Reachability (BFS): 341 iterations in 4.04 seconds (average 0.011833, setup 0.00)

Time for model construction: 4.933 seconds.

Type:        DTMC
States:      317718526 (1 initial)
Transitions: 318767101

Transition matrix: 120213 nodes (3 terminal), 318767101 minterms, vars: 331r/331c

Warning: Switching to MTBDD engine (default for heuristic=speed and this state space size).

Prob0: 341 iterations in 3.83 seconds (average 0.011223, setup 0.00)

Prob1: 1 iterations in 0.01 seconds (average 0.005000, setup 0.00)

goal = 1, inf = 0, maybe = 317718525

Computing remaining rewards...
Engine: MTBDD

Iteration matrix MTBDD... [nodes=119744] [2338.8 Kb]
Diagonals MTBDD... [nodes=51148] [999.0 Kb]

Starting iterations...
Iteration 57: 5.07 sec so far
Iteration 88: 10.47 sec so far
Iteration 116: 15.60 sec so far
Iteration 139: 20.72 sec so far
Iteration 155: 25.76 sec so far
Iteration 176: 30.88 sec so far
Iteration 197: 35.95 sec so far
Iteration 219: 41.04 sec so far
Iteration 245: 46.22 sec so far
Iteration 271: 51.28 sec so far

Jacobi: 311 iterations in 54.63 seconds (average 0.175347, setup 0.10)

Value in the initial state: 4.069269180297852

Time for model checking: 58.945 seconds.

Result: 4.069269180297852 (value in the initial state)


Overall running time: 64.515 seconds.

---------------------------------------------------------------------

Note: There were 62 warnings during computation.